#pragma once
#include"RBTree.h"

namespace cls
{
	template<class K,class V>
	class map
	{
		class MapKeyOfT
		{
		public:
			const K& operator()(const pair<K,V>& kv)
			{
				return kv.first;
			}	
		};
	public:
		typedef typename RBTree<K,pair<const K,V>,MapKeyOfT>::_iterator iterator;
		typedef typename RBTree<K,pair<const K,V>,MapKeyOfT>::_const_iterator const_iterator;

		iterator begin()
		{
			return _t.Begin();
		}
		
		iterator end()
		{
			return _t.End();
		}

		const_iterator begin() const
		{
			return _t.Begin();
		}
		  
		const_iterator end()  const
		{
			return _t.End();
		}

		pair<iterator, bool>  insert(const pair<K, V>& kv)
		{
			return _t.Insert(kv);
		}

		V& operator[](const K& key)
		{
			pair<iterator, bool> ret = insert({ key,V()});
			return ret.first->second;
		}

	private:
		RBTree<K, pair<const K, V>, MapKeyOfT> _t;
	};





}
